A Tutorial on Stålmarcks's Proof Procedure for Propositional Logic
نویسندگان
چکیده
We explain St almarck's proof procedure for classical propo-sitional logic. The method is implemented in a commercial tool that has been used successfully in real industrial veriication projects. Here, we present the proof system underlying the method, and motivate the various design decisions that have resulted in a system that copes well with the large formulas encountered in industrial-scale veriication.
منابع مشابه
A Tutorial on St Almarck's Proof Procedure for Propositional Logic a Tutorial on St Almarck's Proof Procedure for Propositional Logic
We explain St almarck's proof procedure for classical propo-sitional logic. The method is implemented in a commercial tool that has been used successfully in real industrial veriication projects. Here, we present the proof system underlying the method, and motivate the various design decisions that have resulted in a system that copes well with the large formulas encountered in industrial-scale...
متن کاملA Tutorial on the Use of Propositional Logic and St Almarck's Method in System Veriication Part I: Propositional Logic and Simple System Modelling 1 Introduction
We explain the use of propositional logic, and in particular of St almarck's method of propositional proof, in modelling and verifying nite-state reactive systems. One approach to the problem of verifying complex systems is to express both the system and the requirements on the system as logical formulas. Then, veriication comes down to doing a logical proof about some combination of the two fo...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملTutorial on Reasoning in Expressive Non-Classical Logics with Isabelle/HOL
Non-classical logics (such as modal logics, description logics, conditional logics, multi-valued logics, hybrid logics, etc.) have many applications in artificial intelligence. In this tutorial, we will demonstrate a generic approach to automate propositional and quantified variants of non-classical logics using theorem proving systems for classical higher-order logic. Our particular focus will...
متن کامل